Normality of some binary linear codes
نویسنده
چکیده
We show that all binary codes of lengths 16, 17 and 18, or redundancy 10, are normal. These results have applications in the construction of codes that attain t[n, k], the smallest covering radius of any binary linear code.
منابع مشابه
On the Normality of (Non-Mixed and Mixed) Optimal Covering Codes
According to the experiences, it is a known fact that some essential features of normal codes are quite different for binary and for non-binary codes. After giving some explanation concerning this observation by referring to an old conjecture with its partial proof, its possible extensions and restrictions, and by giving some counterexamples in Section 3, subsequently an interesting inequality ...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملReverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages
Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...
متن کاملSome Good Cyclic and Quasi-Twisted Z4-Linear Codes
For over a decade, there has been considerable research on codes over Z4 and other rings. In spite of this, no tables or databases exist for codes over Z4, as is the case with codes over finite fields. The purpose of this work is to contribute to the creation of such a database. We consider cyclic, negacyclic and quasi-twisted (QT) codes over Z4. Some of these codes have binary images with bett...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009